Capacities of multiconnected memory models

نویسندگان

  • D. Horn
  • M. Usher
چکیده

2014 We study generalizations of the Hopfield model for associative memory which contain interactions of R spins with one another and allow for different weights for input patterns. Using probabilistic considerations we show that stability criteria lead to capacities which increase like powers of NR-1. Investigating numerically the basins of attraction we find behaviour which agrees with theoretical expectations. We introduce the more stringent definition of « coverage-capacity » by requiring the whole phase-space to be covered by the basins of attraction of the input patterns. Even under these conditions we find large numbers of patterns which can be used to design an output spectrum by varying the input weights. J. Phys. France 49 (1988) 389-395 MARS 1988, Classification Physics Abstracts 05.50 75.10H 87.30G

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Hardware for multiconnected networks: the design flow

This paper presents an architectural study that may be used to design and develop a general, efficient hardware for multiconnected networks. Starting from the constraints, the proposed design flow allows an accurate evaluation of cost and performance of the final implementation. The generality of the architecture permits the realization of networks with practically any size or topologies.

متن کامل

Semilinear Elliptic Boundary-value Problems on Bounded Multiconnected Domains

A semilinear elliptic boundary-value problem on bounded multiconnected domains is studied. The authors prove that under suitable conditions, the problem may have no solutions in certain cases and many have one or two nonnegative solutions in some other cases. The radial solutions were also studied in annular domains.

متن کامل

Upper Bounds on Two-Dimensional Constraint Capacities via Corner Transfer Matrices

We study the capacities of a family of two-dimensional constraints, containing the hard squares, non-attacking kings and read-write isolated memory models. Using an assortment of techniques from combinatorics, statistical mechanics and linear algebra, we prove upper bounds on the capacities of these models. Our starting point is Calkin and Wilf’s transfer matrix eigenvalue upper bound. We then ...

متن کامل

On the Identities for Elastostatic Fundamental Solution and Nonuniqueness of the Traction BIE Solution for Multiconnected Domains

In this paper, the four integral identities satisfied by the fundamental solution for elastostatic problems are reviewed and slightly different forms of the third and fourth identities are presented. Two new identities, namely the fifth and sixth identities, are derived. These integral identities can be used to develop weakly singular and nonsingular forms of the boundary integral equations (BI...

متن کامل

Reducing Computational and Memory Cost of Substructuring Technique in Finite Element Models

Substructuring in the finite element method is a technique that reduces computational cost and memory usage for analysis of complex structures. The efficiency of this technique depends on the number of substructures in different problems. Some subdivisions increase computational cost, but require little memory usage and vice versa. In the present study, the cost functions of computations and me...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2017